Grassmann homomorphism and Hajós-type theorems
نویسندگان
چکیده
منابع مشابه
Grassmann Homomorphism and Hajós-type Theorems
Let V and W be vector spaces over a common field, and let S and T be sets of subspaces of V and W, respectively. A linear function φ : V → W is called a (Grassmann) homomorphism from S to T if φ(S) ∈ T holds for every S ∈ S. Coloring of graphs and hypergraphs and flows in graphs can be reformulated in terms of these homomorphisms. The main results are constructive characterizations of the sets ...
متن کاملGrassmann-Berezin Calculus and Theorems of the Matrix-Tree Type
We prove two generalizations of the matrix-tree theorem. The first one, a result essentially due to Moon for which we provide a new proof, extends the “all minors” matrix-tree theorem to the “massive” case where no condition on row or column sums is imposed. The second generalization, which is new, extends the recently discovered Pfaffian-tree theorem of Masbaum and Vaintrob into a “Hyperpfaffi...
متن کاملColourful Theorems and Indices of Homomorphism Complexes
We extend the colourful complete bipartite subgraph theorems of [G. Simonyi, G. Tardos, Local chromatic number, Ky Fan’s theorem, and circular colorings, Combinatorica 26 (2006), 587–626] and [G. Simonyi, G. Tardos, Colorful subgraphs of Kneser-like graphs, European J. Combin. 28 (2007), 2188–2200] to more general topological settings. We give examples showing that the hypotheses are indeed mor...
متن کاملCategorical Abstract Algebraic Logic: Leibniz Equality and Homomorphism Theorems
The study of structure systems, an abstraction of the concept of firstorder structures, is continued. Structure systems have algebraic systems rather than universal algebras as their algebraic reducts. Moreover, their relational component consists of a collection of relation systems on the underlying functors rather than simply a system of relations on a single set. Congruence systems of struct...
متن کاملDichotomy Theorems for Homomorphism Polynomials of Graph Classes
In this paper, we will show dichotomy theorems for the computation of polynomials corresponding to evaluation of graph homomorphisms in Valiant’s model. We are given a fixed graph H and want to find all graphs, from some graph class, homomorphic to this H. These graphs will be encoded by a family of polynomials. We give dichotomies for the polynomials for cycles, cliques, trees, outerplanar gra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2017
ISSN: 0024-3795
DOI: 10.1016/j.laa.2017.02.013